Coeecient Rate and Lossy Source Coding
نویسندگان
چکیده
Campbelll1] derived and deened a quantity called the coeecient rate of a random process that involves the process spectral entropy. Two new derivations of Campbell's coeecient rate are given here. One derivation solidiies the interpretation of this quantity as a coeecient rate, while the second derivation implies a new approach for source compression. We investigate this new approach for transform coding of images and compare its performance to the classical methods in terms of performance for a particular image-coding example. This new compression approach is also contrasted with rate-distortion-theoretic optimal coding with respect to a mean squared error delity criterion when the transform coeecients are Gaussian. It is further shown that this new compression method can have an advantage over rate distortion optimal approaches if the actual bandwidth available is less than the design bandwidth.
منابع مشابه
Lossy Source Coding - Information Theory, IEEE Transactions on
Lossy coding of speech, high-quality audio, still images, and video is commonplace today. However, in 1948, few lossy compression systems were in service. Shannon introduced and developed the theory of source coding with a fidelity criterion, also called rate-distortion theory. For the first 25 years of its existence, rate-distortion theory had relatively little impact on the methods and system...
متن کاملLossless Source Coding Lecture Notes & Examples
variously referred to as source coding, lossless coding, noiseless coding or entropy coding exactly and without error, the original message. Lossless coding implies that the message may be decoded back to the original sequence of symbols. The converse of lossless coding (“lossy” coding) implies some degree of approximation of the original message. lossless coding may augment lossy coding, eg VQ...
متن کاملSTA 563 : Lecture 9 – Rate Distortion Information Theory
9.1 Motivation: Quantization of Random Variables . . . . . . . . . . . . . . . . . . . . . 1 9.2 Lossy Source Coding Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 9.3 The Rate Distortion Coding Theorem . . . . . . . . . . . . . . . . . . . . . . . . . . 4 9.3.1 Example: Binary Source . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 9.3.2 Example: Gaussian ...
متن کاملOn Lossless Quantum Data Compression and Quan- tum Variable–Length Codes
In Shannon’s Foundation of Information Theory ([27]) perhaps the most basic contributions are Source Coding Theorems (lossy and lossless) and the Channel Coding Theorem. In the most natural and simple source model DMS the source outputs a sequence X1, X2, . . . of independent, identically distributed random variables taking finitely many values. The Lossy Source Coding Theorem says that this se...
متن کاملSource Coding Algorithms Using the Randomness of a Past Sequence
We propose source coding algorithms that use the randomness of a past sequence. The proposed algorithms solve the problems of multi-terminal source coding, rate-distortion source coding, and source coding with partial side information at the decoder. We analyze the encoding rate and the decoding error rate in terms of almost-sure convergence. key words: bits-back coding, lossy source coding, mu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008